Exploration of Proximity Heuristics in Length Normalization

نویسنده

  • Pranav Agrawal
چکیده

Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking functions should be analyzed before applying it on a data set. This paper gives guidelines on construction of generalized ranking functions with applicationdependent features. The paper prescribes a specific case of a generalized function for recommendation system using feature engineering guidelines on the given data set. The behavior of both generalized and specific functions are studied and implemented on the unstructured textual data. The proximity feature based ranking function has outperformed by 52 % from regular BM25.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring environments by hand or foot: time-based heuristics for encoding distance in movement space.

In Experiment 1, blindfolded observers judged (a) the distance of pathways felt by hand and (b) the straight-line distance between pathway endpoints inferred from such exploration. In Experiment 2, blindfolded observers made corresponding estimates after traversing similar pathways on foot. Pathways were explored under three different speeds. Under both manipulatory and ambulatory exploration, ...

متن کامل

LQR-Based Heuristics for Rapidly Exploring State Space

Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex, non-convex constraints. In practice, these algorithms perform very well on configuration space planning, but struggle to grow efficiently in systems with dynamics or differential constraints when using conventional proximity met...

متن کامل

A Quadratic Regulator - Based Heuristic for Rapidly Exploring State Space by Elena

Kinodynamic planning algorithms like Rapidly-Exploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex, non-convex constraints. In practice, these algorithms perform very well on configuration space planning, but struggle to grow efficiently in systems with dynamics or differential constraints. This is due in part to the fact tha...

متن کامل

Critical Systems Heuristics (CSH) to Deal with Stakeholders' Contradictory Viewpoints of Iran Performance Based Budgeting System

Objective: Performance based budgeting is an undeniable necessity for effective management of the country vital resources nowadays, which benefits all economic and social layers of the society if properly implemented. Accordingly, this has encouraged lots of studies and researches on PPB theories, concepts and models. This study deeply reviewed Iran’s PBB system within four basic issues, includ...

متن کامل

A new normalization technique for cursive handwritten words

This paper presents new techniques for slant and slope removal in cursive handwritten words. Both methods require neither heuristics nor parameter tuning. This avoids the heavy experimental e€ort required to ®nd the optimal con-®guration of a parameter set. A comparison between the new deslanting technique and the method proposed by Bo-zinovic and Srihari was made by measuring the performance o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.01417  شماره 

صفحات  -

تاریخ انتشار 2017